منابع مشابه
Min-Wise Independent Permutations
We define and study the notion of min-wise independent families of permutations. We say that F ⊆ Sn is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr(min{π(X)} = π(x)) = 1 |X| . In other words we require that all the elements of any fixed set X have an equal chance to become the minimum element of the image of X under π. Our research was mo...
متن کاملMin-wise independent groups with respect to any linear order
A finite permutation group G on a linearly ordered set Ω is said to be a k-min-wise independent group, k-MWI for short, if Pr(minπ(X) = π(x)) = 1/|X| for every X ⊆ Ω such that |X| ≤ k and for every x ∈ X. We are concerned with the case of k-MWI groups for any linear order. Indeed, we prove that a permutation group G is k-MWI with respect to any linear order if and only if for every h ≤ k and fo...
متن کاملMin-Wise Independent Linear Permutations
A set of permutations F ⊆ Sn is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have P (min{π(X)} = π(x)) = 1 |X| . This notion was introduced by Broder, Charikar, Frieze and Mitzenmacher and is motivated by an algorithm for filtering near-duplicate web documents. Linear permutations are an important class of permutations. Let p be a (large) prime a...
متن کاملOn (ε, k)-min-wise independent permutations
A family of permutations F of [n] = {1, 2, . . . , n} is (ε, k)-min-wise independent if for every nonempty subset X of at most k elements of [n], and for any x ∈ X, the probability that in a random element π of F , π(x) is the minimum element of π(X), deviates from 1/|X| by at most ε/|X|. This notion can be defined for the uniform case, when the elements of F are picked according to a uniform d...
متن کاملA Derandomization Using Min-Wise Independent Permutations
Min-wise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The later has proven essential for the derandomization of many algorithms. Here we show that approximate min-wise independence allows similar uses, by presenting a derandomization of the RNC algorithm for approximate set cover due to S. Rajagopalan and V. Vazirani. We also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2003
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(03)00081-7